String graph construction using incremental hashing
نویسندگان
چکیده
منابع مشابه
String graph construction using incremental hashing
MOTIVATION New sequencing technologies generate larger amount of short reads data at decreasing cost. De novo sequence assembly is the problem of combining these reads back to the original genome sequence, without relying on a reference genome. This presents algorithmic and computational challenges, especially for long and repetitive genome sequences. Most existing approaches to the assembly pr...
متن کاملQuick Trajectory Generation for Manipulators Using Incremental Randomized Graph Construction
Quick trajectory generation for manipulators are a prerequisite for task oriented (i.e. only tell what to do, but not how) manipulator control, because e.g. in order to grasp an object, rst the motion to reach that object must be performed. In addition, for dynamic environments the generation of the trajectory must be done very quick. This can be achieved using a graph based approach. Furthermo...
متن کاملIncremental Construction of Millstream Configurations Using Graph Transformation
Millstream systems are a non-hierarchical model of natural language. We describe an incremental method for building Millstream configurations while reading a sentence. This method is based on a lexicon associating words and graph transformation rules.
متن کاملFast kNN Graph Construction with Locality Sensitive Hashing
The k nearest neighbors (kNN) graph, perhaps the most popular graph in machine learning, plays an essential role for graphbased learning methods. Despite its many elegant properties, the brute force kNN graph construction method has computational complexity of O(n), which is prohibitive for large scale data sets. In this paper, based on the divide-and-conquer strategy, we propose an efficient a...
متن کاملSupervised Incremental Hashing
We propose an incremental strategy for learning hash functions with kernels for largescale image search. Our method is based on a two-stage classification framework that treats binary codes as intermediate variables between the feature space and the semantic space. In the first stage of classification, binary codes are considered as class labels by a set of binary SVMs; each corresponds to one ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2014
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btu578